Distributed Detection Methods for Byzantine Attack in Tree Topology

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

islanding detection methods for microgrids

امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...

15 صفحه اول

Byzantine Failure Detection for Dynamic Distributed Systems

Byzantine failure detectors provide an elegant abstraction for implementing Byzantine fault tolerance. However, as far as we know, there is no general solution for this problem in a dynamic distributed system over wireless networks with unknown membership. This paper presents thus a rst Byzantine failure detector for this context. The protocol has the interesting feature to be time-free, that i...

متن کامل

Attack-Aware Cooperative Spectrum Sensing in Cognitive Radio Networks under Byzantine Attack

Cooperative Spectrum Sensing (CSS) is an effective approach to overcome the impact of multi-path fading and shadowing issues. The reliability of CSS can be severely degraded under Byzantine attack, which may be caused by either malfunctioning sensing terminals or malicious nodes. Almost, the previous studies have not analyzed and considered the attack in their models. The present study introduc...

متن کامل

Distributed Bayesian Detection with Byzantine Data

In this paper, we consider the problem of distributed Bayesian detection in the presence of Byzantines in the network. It is assumed that a fraction of the nodes in the network are compromised and reprogrammed by an adversary to transmit false information to the fusion center (FC) to degrade detection performance. The problem of distributed detection is formulated as a binary hypothesis test at...

متن کامل

Byzantine Fault Tolerant Distributed Quickest Change Detection

We introduce and solve the problem of Byzantine fault tolerant distributed quickest change detection in both continuous and discrete time setups. In this problem, multiple sensors sequentially observe random signals from the environment and send their observations to a control center that will determine whether there is a change in the statistical behavior of the observations. An unknown subset...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2014

ISSN: 0975-8887

DOI: 10.5120/15817-4238